On the optimality of Bellman-Ford-Moore shortest path algorithm
نویسندگان
چکیده
We prove a general lower bound on the size of switching-and-rectifier networks over any semiring of zero characteristic, including the (min,+) semiring. Using it, we show that the classical dynamic programming algorithm of Bellman, Ford and Moore for the shortest s-t path problem is optimal, if only Min and Sum operations are allowed.
منابع مشابه
Verilog Implementation of a System for Finding Shortest Path by Using Bellman Ford Algorithm
There exit several high speed computation applications that requires minimum distance computation between nodes in weighted graph. Dedicated techniques exist for this purpose are called as shortest path computation. Depending upon need of application, there are three type of shortest path problems; Single Source Shortest Path (SSSP), Single Destination Shortest Path (SDSP) and All Pair Shortest...
متن کاملShortest Paths and Negative Cycle Detection in Graphs with Negative Weights — I: The Bellman-Ford-Moore Algorithm Revisited
Since the mid 1950’s when Bellman, Ford, and Moore developped their shortest path algorithm various attempts were made to beat the O(n ·m) barrier without success. For the special case of integer weights Goldberg’s algorithm gave a theoretical improvement, but the algorithm isn’t competative in praxis. This technical report is part one of a summary of existing n-pass algorithms and some new var...
متن کاملA Fine Tuned Hybrid Implementation for Solving Shortest Path Problems using Bellman Ford
In this paper a hybrid implementation for Bellman-Ford to solve shortest path problems is proposed using OpenCL. Here first parallel implementation for Bellman-Ford for single source shortest path (SSSP) problem and all pair shortest path (APSP) are analyzed on CPU and GPU and based on this analysis work is divided among CPU and GPU and hybrid implementation is done. As proper resource utilizat...
متن کاملOn the K shortest path trees problem
We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m) space algorithm to determine the K shortes...
متن کاملA Data Parallel Algorithm for Seismic Raytracing
Dijkstra’s single-source shortest path algorithm has been applied in seismic tomography to determine paths of minimum travel time from all locations in a 3D earth model to sensors used in seismic experiments. An iterative data parallel algorithm is formulated for seismic tomography based on the Bellman-Ford-Moore (BFM) algorithm. Performance is demonstrated for OpenMP and OpenCL.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 628 شماره
صفحات -
تاریخ انتشار 2015